package 数组;

/**
 * https://leetcode-cn.com/problems/minimum-size-subarray-sum/
 */
public class _209_长度最小的子数组 {


    public int minSubArrayLen(int target, int[] nums) {
        int[] temp = nums;
        int start = 0;
        int count = 0;
        while (start < nums.length){
            count += nums[start];
            start++;
        }

        return -1;
    }


}
